k-Arbiter: A safe and general scheme for h-out of-k mutual exclusion
نویسندگان
چکیده
منابع مشابه
k-Arbiter: A Safe and General Scheme for h-out of-k Mutual Exclusion
Mutual exclusion is a well-known problem that arise when multiple processes compete, in an uncoordinated way, for the acquisition of shared resources over a distributed system. In particular, k-mutual exclusion allows at most k processes to get one unit of the same resource simultaneously. These paradigms do not cover all the cases in which resource accesses must be serialized over a distribute...
متن کامل(h, k)-Arbiters for h-out-of-k mutual exclusion problem
h-out of-k mutual exclusion is a generalization of 1mutual exclusion problem, where there are k units of shared resources and each process requests h(1 h k) units at the same time. Though k-arbiter has been shown to be a quorum-based solution to this problem, quorums in k-arbiter are much larger than these in the 1-coterie for 1-mutual exclusion. Thus, the algorithm based on k-arbiter needs man...
متن کاملA Fault-Tolerant h-Out of-k Mutual Exclusion Algorithm Using Cohorts Coteries for Distributed Systems
In this paper, we propose a distributed algorithm for solving the h-out of-k mutual exclusion problem with the aid of a specific k-coterie cohorts coterie. The proposed algorithm is resilient to node and/or link failures, and has constant message cost in the best case. Furthermore, it is a candidate to achieve the highest availability among all the algorithms using k-coteries. We analyze the ...
متن کاملA distributed token based h-out of-k Mutual Exclusion protocol for mobile ad hoc networks
In this paper, we describe a new token based h-out of-k mutual exclusion protocol for mobile ad hoc networks. This protocol does neither use the routing layer nor a logical structure and agrees requests based on their distances away to the token, their olds, and there resources number. A request is sent on the routes of the nodes for which a request is present in the local queue, with a dynamic...
متن کاملNondominated k-Coteries for Multiple Mutual Exclusion
Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. In order to enter its critical section, a node must obtain permission from a quorum of nodes. A collection of quorums is called a coterie. The most resilient coteries are called nondominated coteries. Recently, k-coteries were proposed to be used in mutual exclusion algorithms that allow up to k entr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00303-4